Dominance-Based Decision Theory

نویسنده

  • Kenny Easwaran
چکیده

Decision theory has been plagued with a variety of problems almost from the start. Some, like the Ellsberg paradox [Ellsberg, 1961] merely seem to point to the problems actual people have in calculating probabilities and utilities. Others, like the Newcomb paradox and its relatives, have motivated a re-foundation of decision theory on causal grounds rather than evidential grounds [Joyce, 1999]. Recent work of Harris Nover, Alan Hájek, and Mark Colyvan has revealed more problems with the way decision theory deals with the infinite, brought out in [Nover and Hájek, 2004] with the Pasadena Game a variant of the St. Petersburg game that puzzled the 18th century founders of decision theory, which has no expected value, rather than the infinite one of St. Petersburg. I believe that a different formalism may deal better with these infinities, and may suggest interesting new ways to think about the problems of causality and undefined probability that affect the others. The goal of decision theory has traditionally been to explicate the way that (perhaps idealized) rational agents choose (or ought to choose) a single action to perform from among the actions available to them at any moment. The traditional theory has done this by associating each action with a real number, known as its expected utility, and saying that a rational agent will perform the action whose expected utility is highest (or one among such, if there is more than one). This theory has been supported by representation theorems [Joyce, 1999, p. 96, p. 127] showing that any agent whose preferences among actions satisfy certain seemingly plausible assumptions can always be interpreted as having utility and credence functions according to which she is maximizing expected utility. It has also been bolstered by theorems of probability, like the Strong Law of Large Numbers, and the Central Limit Theorem, together showing that an agent who behaves otherwise will almost certainly have lower utility overall than an agent who maximizes expected utility. However, these results seem almost too good to be true. If all we wanted was a way to pick one action from among many at any moment, then assigning real numbers (as opposed to some other ordered objects) seems like overkill. And this is right the great power of these results demands very strong conditions. First of all, the agent must at least implicitly have a well-defined probability for each

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dominance-based Rough Set Analysis for Uncertain Data Tables

In this paper, we propose a dominance-based rough set approach for the decision analysis of a preference-ordered uncertain data table, which is comprised of a finite set of objects described by a finite set of criteria. The domains of the criteria may have ordinal properties that express preference scales. In the proposed approach, we first compute the degree of dominance between any two object...

متن کامل

A Dominance Degree for Rough Sets and Its Application in Ranking Popularity

Rough set theory is used in data mining through complex learning systems and uncertain information decision from artificial intelligence. For multiple attribute decision making, rough sets employ attribute reduction to generate decisive rules. However, dynamic information databases, which record attribute values changing with time, raise questions to rough set based multiple attribute reduction...

متن کامل

Knowledge Reductions in Inconsistent Information Systems Based on Dominance Relations

Knowledge reduction is one of the most important problems in rough set theory. However, most of information systems are not only inconsistent, but also based on dominance relations because of various factors. To acquire brief decision rules from inconsistent systems based on dominance relations, knowledge reductions are needed. The main aim of this paper is to study the problem. The assignment ...

متن کامل

Quality of Rough Approximation in Multi-criteria Classification Problems

Dominance-based Rough Set Approach (DRSA) has been proposed to deal with multi-criteria classification problems, where data may be inconsistent with respect to the dominance principle. In this paper, we consider different measures of the quality of approximation, which is the value indicating how much inconsistent the decision table is. We begin with the classical definition, based on the relat...

متن کامل

Optimized Generalized Decision in Dominance-Based Rough Set Approach

Dominance-based Rough Set Approach (DRSA) has been proposed to deal with multi-criteria classification problems, where data may be inconsistent with respect to the dominance principle. However, in real-life datasets, in the presence of noise, the notions of lower and upper approximations handling inconsistencies were found to be excessively restrictive which led to the proposal of the variable ...

متن کامل

Dominance-Based Rough Sets Using Indexed Blocks as Granules

Dominance-based rough set introduced by Greco et al. is an extension of Pawlak’s classical rough set theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes satisfying upward and downward union properties. This paper introduces the concept of indexed blocks for representing dominance-based approximation spaces. Indexed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007